Non-stabilizer quantum codes from Abelian subgroups of the error group

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-stabilizer quantum codes from Abelian subgroups of the error group

This paper is motivated by the computer-generated nonadditive code described in Rains et al [RHSN97]. We describe a theory of non-stabilizer codes of which the nonadditive code of Rains et al is an example. Furthermore, we give a general strategy of constructing good nonstabilizer codes from good stabilizer codes and give some explicit constructions and asymptotically good nonstabilizer codes. ...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

The number of Fuzzy subgroups of some non-abelian groups

In this paper, we compute the number of fuzzy subgroups of some classes of non-abeilan groups. Explicit formulas are givenfor dihedral groups $D_{2n}$, quasi-dihedral groups $QD_{2^n}$, generalized quaternion groups $Q_{4n}$ and modular $p$-groups $M_{p^n}$.

متن کامل

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes

In the last lecture we learned of the quantum error correcting criteria and we discussed how it was possible for us to digitize quantum errors. But we didn’t talk about any concrete codes, the talk was in many ways very existential on these things called quantum error correcting codes. Of course we saw in Shor’s code that such codes could exist for single qubit errors. In this lecture we will i...

متن کامل

Quantum Error-correction Codes on Abelian Groups

In classical public key cryptography the security of the cryptosystems are based on the difficulty of calculating certain functions. A famous example is the ASP cryptosystem which was based on the assumption that factoring large integers could not be done in polynomial time (on classical computers). The typical situation in these systems is that two parties (Bob and Alice) whish to communicate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information and Computation

سال: 2004

ISSN: 1533-7146,1533-7146

DOI: 10.26421/qic4.6-7-2